Line Simplification Algorithms
نویسنده
چکیده
Work on the generalisation of cartographic line data, so that small scale map data can be derived from larger scales, has led to the development of algorithms for a variety of generalisation operations, including line simplification. A major objective when capturing linear digital map data is the creation of accurate representation of naturally occurring lines, using a minimum of processing time and storage. When paper maps are converted into a digital representation using manual digitising methods, one time saving method used is that of stream mode digitising. In stream mode the digitiser samples continuously as the cursor is moved along the manuscript line. Co-ordinate density in stream mode is usually determined by time interval, which can lead to the generation of surplus co-ordinate data. For a number of practical considerations this superfluous data should be eliminated. These considerations include:
منابع مشابه
A Novel Evaluation Approach for Line Simplification Algorithms towards Vector Map Visualization
Line simplification is an important method in the context of cartographic generalization, which is helpful for improving the visualization of digital vector maps. The evaluation method for the simplification algorithms is still an open issue when facing applications of vector data, including progressive transmission, web mapping, and so on. This paper proposes a novel evaluation approach for li...
متن کاملA New Approach to Subdivision Simplification"
The line simplification problem is an old and well-studied problem in car tography. Although there are several efficient algorithms to compute a simpli fication within a specified error bound, there seem to be no algorithms that perform line simplification in the context of other geographical objects. Given a polygonal line and a set of extra points, we present a nearly quadratic time algorithm...
متن کاملLine Simplification Algorithms
for the talk on Abstract We will give an overview of different methods for polyline simplification. Different algorithms will be presented. Special emphasis will be given to the
متن کاملMinimising Positional Errors in Line Simplification Using Adaptive Tolerance Values
Line simplification is an important function in GIS and cartography and is widely used in commercial GIS software packages. Most line simplification algorithms require the user to supply a tolerance value, which is used to determine the extent to which simplification is to be applied.. All simplification algorithms induce positional errors in the data set, because they produce a discrepancy bet...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملReverse Subdivision for Optimizing Visibility Tests
Certain applications require knowledge of whether two entities are visible to each other over a terrain, determined using a line-of-sight computation. Several fast algorithms exist for terrain line-of-sight computations. However, performing numerous line-of-sight computations, particularly over a large terrain data set, can be highly resource-intensive (in run time and/or memory). Methods from ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000